Zero-point attracting projection algorithm for sequential compressive sensing
نویسندگان
چکیده
Sequential Compressive Sensing, which may be widely used in sensing devices, is a popular topic of recent research. This paper proposes an online recovery algorithm for sparse approximation of sequential compressive sensing. Several techniques including warm start, fast iteration, and variable step size are adopted in the proposed algorithm to improve its online performance. Finally, numerical simulations demonstrate its better performance than the relative art.
منابع مشابه
A Forward-Backward Projection Algorithm for Approximating of the Zero of the Sum of Two Operators
In this paper, a forward-backward projection algorithm is considered for finding zero points of the sum of two operators in Hilbert spaces. The sequence generated by algorithm converges strongly to the zero point of the sum of an $alpha$-inverse strongly monotone operator and a maximal monotone operator. We apply the result for solving the variational inequality problem, fixed po...
متن کاملA Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...
متن کاملExtra Gain: Improved Sparse Channel Estimation Using Reweighted l_1-norm Penalized LMS/F Algorithm
The channel estimation is one of important techniques to ensure reliable broadband signal transmission. Broadband channels are often modeled as a sparse channel. Comparing with traditional dense-assumption based linear channel estimation methods, e.g., least mean square/fourth (LMS/F) algorithm, exploiting sparse structure information can get extra performance gain. By introducing -norm penalty...
متن کاملGeneralized Alternating Projection for Weighted-퓁2, 1 Minimization with Applications to Model-Based Compressive Sensing
We consider the group basis pursuit problem, which extends basis pursuit by replacing the l1 norm with a weighted-l2,1 norm. We provide an anytime algorithm, called generalized alternating projection (GAP), to solve this problem. The GAP algorithm extends classical alternating projection to the case in which projections are performed between convex sets that undergo a systematic sequence of cha...
متن کاملRZA-NLMF algorithm-based adaptive sparse sensing for realizing compressive sensing
Nonlinear sparse sensing (NSS) techniques have been adopted for realizing compressive sensing in many applications such as radar imaging. Unlike the NSS, in this paper, we propose an adaptive sparse sensing (ASS) approach using the reweighted zero-attracting normalized least mean fourth (RZA-NLMF) algorithm which depends on several given parameters, i.e., reweighted factor, regularization param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Electronic Express
دوره 9 شماره
صفحات -
تاریخ انتشار 2012